Nonlinear Problems: Analytical and Computational Approach with Applications
نویسندگان
چکیده
منابع مشابه
global results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
A Computational Method for Solving Optimal Control Problems and Their Applications
In order to obtain a solution to an optimal control problem, a numerical technique based on state-control parameterization method is presented. This method can be facilitated by the computation of performance index and state equation via approximating the control and state variable as a function of time. Several numerical examples are presented to confirm the analytical findings and illus...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملLinear and Nonlinear Inverse Problems with Practical Applications
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this linear and nonlinear inverse problems with practical applications by reading this site. We offe...
متن کاملLine Problems in Nonlinear Computational Geometry
We first review some topics in the classical computational geometry of lines, in particular the O(n) bounds for the combinatorial complexity of the set of lines in R interacting with n objects of fixed description complexity. The main part of this survey is recent work on a core algebraic problem—studying the lines tangent to k spheres that also meet 4−k fixed lines.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2012
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2012/967392